Column generation in the integral simplex method
نویسندگان
چکیده
منابع مشابه
Column generation in the integral simplex method
The integral simplex method for set partitioning problems allows only pivots-on-one to be made, which results in a primal all-integer method. In this technical note we outline how to tailor the column generation principle to this method. Because of the restriction to pivots-onone, only local optimality can be guaranteed, and to ensure global optimality we consider the use of implicit enumeratio...
متن کاملAn Integral Simplex Method for Solving Combinatorial Optimization Problems
In this paper a local integral simplex method will be described which, starting with the initial tableau of a set partitioning problem, makes pivots using the pivot on one rule until no more such pivots are possible because a local optimum has been found. If the local optimum is also a global optimum the process stops. Otherwise, a global integral simplex method creates and solves a search tree...
متن کاملA heuristic column generation method for the heterogeneous fleet VRP
This paper presents a heuristic column generation method for solving vehicle routing problems with a heterogeneous fleet of vehicles.The method may also solve the fleet size and composition vehicle routing problem and new best known solutions are reported for a set of classical problems. Numerical results show that the method is robust and efficient, particularly for medium and large size probl...
متن کاملLarge-scale optimization with the primal-dual column generation method
The primal-dual column generation method (PDCGM) is a general-purpose column generation technique that relies on the primal-dual interior point method to solve the restricted master problems. The use of this interior point method variant allows to obtain suboptimal and well-centered dual solutions which naturally stabilizes the column generation. A reduction in the number of calls to the oracle...
متن کاملA column generation method for the (r, p)-centroid problem
Much effort in the discrete location theory has aimed at developing insights concerning the classical models with one decision maker only. In this paper, we study a competitive model with two noncooperative decision makers: the leader and the follower. They compete to attract clients from the given market and wish to maximize their own profits. In fact, this is the noncooperative Stackelberg ga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2009
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2007.09.037